Location:
Search - delaunay three
Search list
Description: 这也是一个delaunay三角网的程序，功能是我见到最强大的。能生成二维和三维，并有openGl创建模拟三维图。原程序中编译时需要wx/的文件，我没有找到。不过不影响程序的学习.希望对你有用！！包中有.exe可先-This is a triangular network nodes procedures, I see the function is the most powerful. Can generate two-dimensional and three-dimensional, and openGl create simulated three-dimensional map. The original procedure required compiler wx / documents, I could not find. But not affect the learning process. Hope useful to you! ! Included in the package. Exe can take a look at!
Platform: |
Size: 48529 |
Author: gaoqing |
Hits:
Description: 三角剖分算法，演示形象-triangulation algorithm, demo image
Platform: |
Size: 59392 |
Author: nlx |
Hits:
Description: 一个华工研究生写的三维模哦具动态装配程序，很有参考价值的-a labor of graduate students to write three-dimensional modeling with dynamic oh assembly procedures, great reference value
Platform: |
Size: 2129920 |
Author: 王涛 |
Hits:
Description: 生长法构造Delauney三角网的程序，对做地形有一定作用-Growth Act tectonic Delauney triangulation procedures, do have a certain effect on the terrain
Platform: |
Size: 88064 |
Author: 杜斐 |
Hits:
Description: Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割—归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割—归并法相当，较好的情况下快于分割—归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it's computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.
Platform: |
Size: 3833856 |
Author: 苏聪 |
Hits:
Description: 这也是一个delaunay三角网的程序，功能是我见到最强大的。能生成二维和三维，并有openGl创建模拟三维图。原程序中编译时需要wx/的文件，我没有找到。不过不影响程序的学习.希望对你有用！！包中有.exe可先-This is a triangular network nodes procedures, I see the function is the most powerful. Can generate two-dimensional and three-dimensional, and openGl create simulated three-dimensional map. The original procedure required compiler wx/documents, I could not find. But not affect the learning process. Hope useful to you! ! Included in the package. Exe can take a look at!
Platform: |
Size: 48128 |
Author: gaoqing |
Hits:
Description: 这时一个delaunay三角网的程序，功能强大，并里面有详细说明和程序及原代码。能创建二维和三维的，且能生成模拟的3D图。-then a triangular network nodes procedures, powerful, and there are detailed procedures and the original code. To be able to create two-dimensional and three-dimensional and can generate simulated 3D map.
Platform: |
Size: 1937408 |
Author: gaoqing |
Hits:
Description: 采用序列化对象CArchive读入原始数据构建Delaunay三角网的VC++代码。可以鼠标点击加新点进行构网，包括二维、三维。还可以进行设色、光照等。-Serializing objects using CArchive read the raw data to build Delaunay triangulation VC++ Code. Mouse clicks can add new points structure network, including the two-dimensional, three-dimensional. Can also be used for colors, light and so on.
Platform: |
Size: 149504 |
Author: 追风 |
Hits:
Description: 利用Delaunay三角剖分算法来进行的三维建模技术在建筑，地质地形勘测，医学图像建模，动画设计等各方面都有广泛的应用。本软件实现逐点插入算法，并且在综合参考以往逐点插入算法的基础上，提出自己的想法，在某些具体细节上进行改进。-Using Delaunay triangulation algorithm for three-dimensional modeling techniques in the construction, geological terrain surveying, medical image modeling, animation and other areas have a wide range of applications. The software implementation point by point insertion algorithm, and comprehensive reference in the previous point by point insertion algorithm based on their own ideas, in some specific details to improve.
Platform: |
Size: 2330624 |
Author: 经惠 |
Hits:
Description: 三维展示应用程序平台，包含窗口的初始化与工具栏等的构建。-Three-dimensional display application platform, including the window toolbar, such as initialization and Construction.
Platform: |
Size: 1024 |
Author: 吕锴 |
Hits:
Description: 不规则三角网的生成源代码。This program generates Triangulated Irregular Network, or TIN from scattered points on two-dimensional plane based on Delaunay s triangulation. This data structure allows data to be displayed as three-dimensional surface, or to be used for terrain analysis including contouring and visibility mapping.-Triangulated irregular network generation of source code. This program generates Triangulated Irregular Network, or TIN from scattered points on two-dimensional plane based on Delaunay s triangulation. This data structure allows data to be displayed as three-dimensional surface, or to be used for terrain analysis including contouring and visibility mapping.
Platform: |
Size: 1198080 |
Author: 风舞 |
Hits:
Description: 论文 Delaunay三角网表示和点删除方法
用vc的环境 很重要-Papers Delaunay triangulation and the point that the method used to delete a very important environment vc
Platform: |
Size: 109568 |
Author: niujiying |
Hits:
Description: Delaunay trianglation 是平面三角化的一种重要方法，也可以应用于三维的四面体的生成。因为用这种方法产生的四面休在有限元分析中具有其独特的优势而受到重视。-Delaunay trianglation plane triangulation is an important method, but also can be applied to the generation of three-dimensional tetrahedron. As generated in this way is surrounded by a short break in finite element analysis has its unique advantages and be taken seriously.
Platform: |
Size: 314368 |
Author: woshidou |
Hits:
Description: 基于matlab软件的delaunay算法划分网格，可以进行三维数据和二维数据的处理-Matlab-based software division algorithm delaunay mesh, can be three-dimensional data and two-dimensional data processing
Platform: |
Size: 852992 |
Author: yanhan |
Hits:
Description: 程序生成TIN三角形，根据2D或者3D的离散点生成，分析-This program generates Triangulated Irregular Network, or TIN from scattered points on two-dimensional plane based on Delaunay s triangulation. This data structure allows data to be displayed as three-dimensional surface, or to be used for terrain analysis including contouring and visibility mapping.
Platform: |
Size: 48128 |
Author: Libz |
Hits:
Description: 此资料介绍的是：利用OpenGL实现三维地形可
视化,采用Delaunay三角化法得到地形采样点,并用已知数据对三角曲面进行插值加密,生成规则格网(GRID)数据结构的方法,可得到高度真实感的三维地形可视化效果。
-The data presented are: the use of OpenGL for three-dimensional terrain visualization, using Delaunay triangulation method to be terrain sampling point, and with the known data encryption on the triangular surface is interpolated to generate the rules Grid (GRID) data structure method can be obtained highly realistic 3D terrain visualization.
Platform: |
Size: 81920 |
Author: 周倩倩 |
Hits:
Description: Delaunay三角剖分算法 . 一个非常强劲的VC编的Delaunay三角网生成算法，对您学习VC++或GIS的学习都有很好的帮助作用-In mathematics, and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation they tend to avoid skinny triangles. The triangulation was invented by Boris Delaunay in 1934 [1].
Based on Delaunay s definition[1], the circumcircle of a triangle formed by three points from the original point set is empty if it does not contain vertices other than the three that define it (other points are permitted only on the very perimeter, not inside).
The Delaunay condition states that a triangle net is a Delaunay triangulation if all the circumcircles of all the triangles in the net are empty. This is the original definition for two-dimensional spaces. It is possible to use it in three-dimensional spaces by using a circumscribed sphere in place of the circumcircl
Platform: |
Size: 36864 |
Author: yulin |
Hits:
Description: Delaunay三角剖分在二维，三维中进行剖分的基础知识，定理以及实现。-Delaunay triangulation in two-dimensional, three-dimensional meshed in the basics, theorems, and to achieve.
Platform: |
Size: 2352128 |
Author: houfengzhi |
Hits:
Description: 简单多边形的三角剖分,在计算机图形学及地学问题三维重建领域有着广泛的应用.根据简单多边形的定义和三角剖分原则,提出了一种简单多边形三角剖分的算法,该算法通过判断某顶点和基边之间的位置来实现对简单多边形的三角剖分算法实现简单容易理解适用于任意简单多边形的三角剖分-Triangulation of simple polygon in computer graphics and three-dimensional reconstruction to study the problem has wide application areas. According to the definition of a simple polygon and triangulation principle, a simple polygon triangulation algorithm, the algorithm for determining whether a between the vertex and edge location-based implementation of a simple polygon triangulation algorithm is simple and easy to understand for any triangulation of simple polygon
Platform: |
Size: 1942528 |
Author: LJY |
Hits:
Description: 一种支持三维Delaunay三角剖分与Voronoi图生成的数据结构，有详细介绍。-That supports three-dimensional Delaunay triangulation and Voronoi diagram data structure, described in detail.
Platform: |
Size: 653312 |
Author: 杜杜 |
Hits: